Admissible heuristic

Results: 82



#Item
41A Mean-based Approach for Real-Time Planning (Extended Abstract) Damien Pellier, Bruno Bouzy, Marc Métivier Laboratoire d’Informatique de Paris Descartes Université Paris Descartes

A Mean-based Approach for Real-Time Planning (Extended Abstract) Damien Pellier, Bruno Bouzy, Marc Métivier Laboratoire d’Informatique de Paris Descartes Université Paris Descartes

Add to Reading List

Source URL: www.math-info.univ-paris5.fr

Language: English - Date: 2012-07-06 09:32:23
42Masashi Shimbo  Real-Time Search with Nonstandard Heuristics  This thesis was submitted to

Masashi Shimbo Real-Time Search with Nonstandard Heuristics This thesis was submitted to

Add to Reading List

Source URL: www.ai.soc.i.kyoto-u.ac.jp

Language: English - Date: 2014-08-06 22:33:04
43Artificial Intelligence–41 www.elsevier.com/locate/artint Controlling the learning process of real-time heuristic search ✩ Masashi Shimbo a,∗ , Toru Ishida b

Artificial Intelligence–41 www.elsevier.com/locate/artint Controlling the learning process of real-time heuristic search ✩ Masashi Shimbo a,∗ , Toru Ishida b

Add to Reading List

Source URL: www.ai.soc.i.kyoto-u.ac.jp

Language: English - Date: 2014-08-06 22:26:41
44Over-Subscription in Planning: a Partial Satisfaction Problem Menkes van den Briel, Romeo Sanchez, and Subbarao Kambhampati Department of Computer Science and Engineering Ira A. Fulton School of Engineering Arizona State

Over-Subscription in Planning: a Partial Satisfaction Problem Menkes van den Briel, Romeo Sanchez, and Subbarao Kambhampati Department of Computer Science and Engineering Ira A. Fulton School of Engineering Arizona State

Add to Reading List

Source URL: www.menkes76.com

Language: English - Date: 2012-10-29 18:15:56
45Journal of Artificial Intelligence Research533  Submitted 12/13; publishedImproving Delete Relaxation Heuristics Through Explicitly Represented Conjunctions

Journal of Artificial Intelligence Research533 Submitted 12/13; publishedImproving Delete Relaxation Heuristics Through Explicitly Represented Conjunctions

Add to Reading List

Source URL: www.jair.org

Language: English - Date: 2014-06-30 19:43:41
46A Hybrid Linear Programming and Relaxed Plan Heuristic for Partial Satisfaction Planning Problems J. Benton Dept. of Computer Science and Engineering Arizona State University

A Hybrid Linear Programming and Relaxed Plan Heuristic for Partial Satisfaction Planning Problems J. Benton Dept. of Computer Science and Engineering Arizona State University

Add to Reading List

Source URL: www.menkes76.com

Language: English - Date: 2012-10-29 18:19:25
47Journal of Artificial Intelligence Research  Submitted 05/14; publishedDeterministic Oversubscription Planning as Heuristic Search: Abstractions and Reformulations

Journal of Artificial Intelligence Research Submitted 05/14; publishedDeterministic Oversubscription Planning as Heuristic Search: Abstractions and Reformulations

Add to Reading List

Source URL: www.jair.org

Language: English - Date: 2015-01-16 19:01:35
48Assignment 1: Intelligent Agents, Search Due September 23 at 12:30pm 49 marks total, worth 5% of final grade This assignment is to be done individually. Important Note: The univeristy policy on academic dishonesty (cheat

Assignment 1: Intelligent Agents, Search Due September 23 at 12:30pm 49 marks total, worth 5% of final grade This assignment is to be done individually. Important Note: The univeristy policy on academic dishonesty (cheat

Add to Reading List

Source URL: www.cs.sfu.ca

Language: English - Date: 2008-09-08 16:56:16
49Directed Unfolding of Petri Nets Blai Bonet1 , Patrik Haslum2 , Sarah Hickmott3 , and Sylvie Thi´ebaux2 1 2  Universidad Sim´

Directed Unfolding of Petri Nets Blai Bonet1 , Patrik Haslum2 , Sarah Hickmott3 , and Sylvie Thi´ebaux2 1 2 Universidad Sim´

Add to Reading List

Source URL: users.cecs.anu.edu.au

Language: English - Date: 2009-04-11 23:05:46
50Optimal Planning with Global Numerical State Constraints Franc Ivankovic, Patrik Haslum, Sylvie Thi´ebaux, Vikas Shivashankar and Dana S. Nau Optimisation Research Group, NICTA Dept. of Comp. Sci., and Inst. for Sys. Rs

Optimal Planning with Global Numerical State Constraints Franc Ivankovic, Patrik Haslum, Sylvie Thi´ebaux, Vikas Shivashankar and Dana S. Nau Optimisation Research Group, NICTA Dept. of Comp. Sci., and Inst. for Sys. Rs

Add to Reading List

Source URL: users.cecs.anu.edu.au

Language: English - Date: 2014-03-14 07:54:37